An index reduction method for linear Hessenberg systems

نویسنده

  • Mohammad Mahdi Hosseini
چکیده

In [E. Babolian, M.M. Hosseini, Reducing index, and pseudospectral methods for differential–algebraic equations, Appl. Math. Comput. 140 (2003) 77–90] a reducing index method has been proposed for some cases of semi-explicit DAEs (differential algebraic equations). In this paper, this method is generalized to more cases. Also, it is focused on Hessenberg index 2 systems and proposed reduction index method will be illustrated for this problem. The Hessenberg system and its obtained reduced index system are numerically solved through pseudospectral method. In addition, aforementioned methods will be considered by one example. 2005 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adomian decomposition method for solution of differential-algebraic equations

Solutions of differential algebraic equations is considered by Adomian decomposition method. In E. Babolian, M.M. Hosseini [Reducing index and spectral methods for differential-algebraic equations, J. Appl. Math. Comput. 140 (2003) 77] and M.M. Hosseini [An index reduction method for linear Hessenberg systems, J. Appl. Math. Comput., in press], an efficient technique to reduce index of semi-exp...

متن کامل

Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method

The rational Krylov sequence (RKS) method is a generalization of Arnoldi's method. It constructs an orthogonal reduction of a matrix pencil into an upper Hessenberg pencil. The RKS method is useful when the matrix pencil may be eeciently factored. This article considers approximately solving the resulting linear systems with iterative methods. We show that a Cayley transformation leads to a mor...

متن کامل

Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems

IDR(s) is one of the most efficient methods for solving large sparse nonsymmetric linear systems of equations. We present two useful extensions of IDR(s), namely a flexible variant and a multi-shift variant. The algorithms exploit the underlying Hessenberg decomposition computed by IDR(s) to generate basis vectors for the Krylov subspace. The approximate solution vectors are computed using a Qu...

متن کامل

A Multishift Hessenberg Method for Pole Assignment of Single-Input Systems

A new algorithm is proposed for the pole assignment of single-input linear time-invariant systems. The proposed algorithm belongs to the family of Hessenberg methods and is based on an implicit multishift QR-like technique. The new method compares favorably in many respects (speed, memory usage) with existing numerically stable methods. Its improved vectorizability guarantees good opportunities...

متن کامل

Varga : a Multishift Hessenberg Method for Pole Assignment of Single - Input Systems 1797

| A new algorithm is proposed for the pole assignment of single-input linear time-invariant systems. The proposed algorithm belongs to the family of Hessenberg methods and is based on an implicit multishift QR-like technique. The new method compares favorably in many respects (speed, memory usage) with existing numerically stable methods. Its improved vectorizability guarantees good opportuniti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 171  شماره 

صفحات  -

تاریخ انتشار 2005